﻿/** 
 * Copyright (c) 2001 University of Maryland, College Park, MD 20742, USA
 * Copyright (c) 2005 In4Arch
 *
 *  The MIT License
 *  Permission is hereby granted, free of charge, to any person obtaining a copy of this 
 *  software and associated documentation files (the "Software"), to deal in the Software 
 *  without restriction, including without limitation the rights to use, copy, modify, merge, 
 *  publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons 
 *  to whom the Software is furnished to do so, subject to the following conditions:
 *
 *  The above copyright notice and this permission notice shall be included in all copies 
 *  or substantial portions of the Software.
 *
 *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, 
 *  INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A 
 *  PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT 
 *  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF 
 *  CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE 
 *  OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 * Authors: Benjamin B. Bederson and Martin Wattenberg 2001 
 * http://www.cs.umd.edu/hcil/treemap-history/index.shtml
 * 
 * Author: moedusa moedusa@gmail.com 2005
 * http://moedusa.name/
 *
 * Author: Nikita Shlyakhov shlyakhov@mail.ru 2006
 **/

 
import in4arch.alg.treemap.Rect;  
import in4arch.alg.treemap.MapModel; 
import in4arch.alg.treemap.AbstractMapLayout; 

/**
 * The original slice-and-dice layout for treemaps.
 */
class in4arch.alg.treemap.SliceLayout extends AbstractMapLayout {
	
    public static var BEST:Number = 2; 
	public static var ALTERNATE:Number = 3;
	
    private var ornt:Number;
    
    public function SliceLayout(ornt:Number) {
		if(ornt == null){
			throw new Error("No orientation provided for the algorithm.");
		}
        this.ornt = ornt;
    }
    
    public function layout(model:MapModel, bounds:Rect):Void {
		var items_array:Array = model.getItems();
        if (ornt == BEST){
            //layoutBest(items_array, 0, items_array.length-1, bounds);
			var orient:Number = bounds.w > bounds.h ? AbstractMapLayout.HORIZONTAL : AbstractMapLayout.VERTICAL;
	        orderedSliceLayout(items_array, 0, items_array.length-1, bounds, orient, AbstractMapLayout.ASCENDING);
		}else if (ornt == ALTERNATE){
            //_layout(items_array, bounds, items_array[0].getDepth()%2);
			ornt = items_array[0].getDepth()%2;
	        orderedSliceLayout(items_array, 0, items_array.length-1, bounds, ornt, AbstractMapLayout.ASCENDING);
		}else{
            throw new Error("No orientation allowed for the identifier "+ornt);
		}
    }	
	
    private function _layout(items_array:Array, bounds:Rect, orient:Number):Void {
        sliceLayout(items_array, 0, items_array.length-1, bounds, orient);
    }
	
    public function layoutBestOrdered(items:Array, start:Number, end:Number, bounds:Rect, order:Number):Void {
		var pos:Number = bounds.w > bounds.h ? AbstractMapLayout.HORIZONTAL : AbstractMapLayout.VERTICAL;
        orderedSliceLayout(items, start, end, bounds, pos, order);
    }

    public function getName():String {
        return "Slice-and-dice";
    }

    public function getDescription():String {
        return "This is the original treemap algorithm, "+
               "which has excellent stability properies "+
               "but leads to high aspect ratios.";
    }
	
}
